Efficiently Estimating Erdos-Renyi Graphs with Node Differential Privacy

We give a simple, computationally efficient, and node-differentially-private algorithm for estimating the parameter of an Erdos-Renyi graph---that is, p in G(n,p)---with near-optimal accuracy. Our nearly matches information-theoretically optimal exponential-time same problem due to Borgs et al. (FOCS 2018). More generally, we optimal, private edge-density any graph whose degree distribution is concentrated small interval.